Analytical solution for the size of the minimum dominating set in complex networks
نویسندگان
چکیده
منابع مشابه
study of cohesive devices in the textbook of english for the students of apsychology by rastegarpour
this study investigates the cohesive devices used in the textbook of english for the students of psychology. the research questions and hypotheses in the present study are based on what frequency and distribution of grammatical and lexical cohesive devices are. then, to answer the questions all grammatical and lexical cohesive devices in reading comprehension passages from 6 units of 21units th...
the effect of using critical discourse analytical tools on the improvement of the learners level of critical thinking in reading comprehension
?it is of utmost priority for an experienced teacher to train the mind of the students, and enable them to think critically and correctly. the most important question here is that how to develop such a crucial ability? this study examines a new way to the development of critical thinking utilizing critical discourse analytical tools. to attain this goal, two classes of senior english la...
the test for adverse selection in life insurance market: the case of mellat insurance company
انتخاب نامساعد یکی از مشکلات اساسی در صنعت بیمه است. که ابتدا در سال 1960، توسط روتشیلد واستیگلیتز مورد بحث ومطالعه قرار گرفت ازآن موقع تاکنون بسیاری از پژوهشگران مدل های مختلفی را برای تجزیه و تحلیل تقاضا برای صنعت بیمه عمر که تماما ناشی از عدم قطعیت در این صنعت میباشد انجام داده اند .وهدف از آن پیدا کردن شرایطی است که تحت آن شرایط انتخاب یا کنار گذاشتن یک بیمه گزار به نفع و یا زیان شرکت بیمه ...
15 صفحه اولConstruction of minimum connected dominating set in wireless sensor networks using pseudo dominating set
In a wireless network, messages need to be sent on in an optimized way to preserve the energy of the network. A minimum connected dominating set (MCDS) offers an optimized way of sending messages. However, MCDS construction is a NP-Hard problem. In this paper, we propose a new degree-based greedy approximation algorithm named as Connected Pseudo Dominating Set Using 2 Hop Information (CPDS2HI),...
متن کاملMaximum graphs with unique minimum dominating set of size two
We prove that the maximum number of edges of a graph of order n which has a unique minimum dominating set of size two is bounded above by ( n−2 2 ) . As a corollary to this result, we prove a conjecture by Fischermann, Rautenbach and Volkmann that the maximum number of edges of a graph which has a unique minimum dominating set of size two is ( n−2 2 ) .
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Modeling, Simulation, and Scientific Computing
سال: 2017
ISSN: 1793-9623,1793-9615
DOI: 10.1142/s1793962317500052